Exploring Circle Packing Algorithms

نویسندگان

  • Kevin Pratt
  • Connor Riley
  • Don Sheehy
چکیده

We present an interactive tool for visualizing and experimenting with different circle packing algorithms. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems—Geometrical problems and computations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dense packings of congruent circles in a circle

The problem of finding packings of congruent circles in a circle, or, equivalently, of spreading points in a circle, is considered. Two packing algorithms are discussed, and the best packings found of up to 65 circles are presented.

متن کامل

Online Circle and Sphere Packing

In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones receive an online sequence of circles (items) of different radii while the third one receive an online sequence of spheres (items) of different radii, and they want to pack the items into the minimum number of unit squares...

متن کامل

Discrete Curvature Based on Osculating Circle Estimation

In this paper, we make an overview of the existing algorithms concerning the discrete curvature estimation. We extend the Worring and Smeulders [WS93] classification to new algorithms and we present a new and purely discrete algorithm based on discrete osculating circle estimation.

متن کامل

Ela Iterations of Concave Maps , the Perron – Frobenius Theory , and Applications to Circle Packings

The theory of pseudo circle packings is developed. It generalizes the theory of circle packings. It allows the realization of almost any graph embedding by a geometric structure of circles. The corresponding Thurston’s relaxation mapping is defined and is used to prove the existence and the rigidity of the pseudo circle packing. It is shown that iterates of this mapping, starting from an arbitr...

متن کامل

Iterations of concave maps, the Perron-Frobenius theory and applications to circle packings

The theory of pseudo circle packings is developed. It generalizes the theory of circle packings. It allows the realization of almost any graph embedding by a geometric structure of circles. The corresponding Thurston’s relaxation mapping is defined and is used to prove the existence and the rigidity of the pseudo circle packing. It is shown that iterates of this mapping, starting from an arbitr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016